In this paper, we promote the packet function (e.g., packet size) -aware extension of the Dijkstra algorithm (i.e.,\nPFA_SPF) as a base algorithm where any routing protocol can evolve it and integrate it with appropriate routing\nmetrics. In particular, we propose a generic algorithm for packet function-aware path setup for multi-hop networks.\nThe algorithm is based on a generic and novel extension of the classical Dijkstra algorithm in which the cost of each\nlink is a non-negative-valued function of packet parameter(s) (e.g., packet size) rather than a scalar value. The\nalgorithm minimizes the sum of the cost functions (e.g., total transmission delay or total energy consumption)\nexperienced by each packet (e.g., maximizing the throughput) from the source to the destination node. We did initial\nanalysis based on simulation of the algorithm for various random multi-hop wireless networks (e.g., 802.11), utilizing\nrealistic link delay models. Finally, we demonstrate the initial significant potential performance improvements of our\nalgorithm over the existing prior art.
Loading....